Continuity and computability of reachable sets
نویسندگان
چکیده
منابع مشابه
Continuity and computability of reachable sets
The computation of reachable sets of nonlinear dynamic and control systems is an important problem of systems theory. In this paper we consider the computability of reachable sets using Turing machines to perform approximate computations. We use Weihrauch's type-two theory of effectivity for computable analysis and topology, which provides a natural setting for performing computations on sets a...
متن کاملReachable sets concept - a
A control problem over the infinite time horizon for periodical system is considered. Our aim is to analyze a special concept of solving problems of this type, based on the known idea of reachable sets. We try to consider this concept in a more general manner than it was done in earlier works and to find what is really essential in it. The algorithm corresponding to the proposed general descrip...
متن کاملRelative computability and uniform continuity of relations
A type-2 computable real function is necessarily continuous; and this remains true for computations relative to any oracle. Conversely, by the Weierstrass Approximation Theorem, every continuous f : [0; 1]→ R is computable relative to some oracle. In their search for a similar topological characterization of relatively computable multi-valued functions f : [0; 1] ⇒ R (also known as multi-functi...
متن کاملComputability of Convex Sets
We investigate computability of convex sets restricted to ra tional inputs Several quite di erent algorithmic characterizations are presented like the existence of e ective approximations by polygons or e ective line intersection tests We also consider approximate compu tations of the n fold characteristic function for several natural classes of convex sets This yields many di erent concrete ex...
متن کاملComputability of Julia Sets
In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.05.001